A Note on Relaxation and Rounding in Algorithmic Mechanism Design

نویسنده

  • Salman Fadaei
چکیده

In this note, we revisit the relaxation and rounding technique employed several times in algorithmic mechanism design. We try to introduce a general framework which covers the most significant algorithms in mechanism design that use the relaxation and rounding technique. We believe that this framework is not only a generalization of the existing algorithms but also can be leveraged for further results in algorithmic mechanism design. Before presenting the framework, we briefly define algorithmic mechanism design, its connections to game theory and computer science, and the challenges in the field.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximation Algorithms Based on Lp Relaxation 1 Linear Programs and Linear Integer Programs

There are two fundamental approximation algorithm design techniques based on linear programming: (a) LP-relaxation and rounding, and (b) the primal-dual method. In this lecture note, we will discuss the former. The idea of LP-relaxation and rounding is quite simple. We first formulate an optimization problem as an integer program (IP), which is like a linear program (LP) with integer variables....

متن کامل

A note on the Survivable Network Design Problem

In this note we consider the survivable network design problem (SNDP) in undirected graphs. We make two contributions. The first is a new counting argument in the iterated rounding based 2-approximation for edge-connectivity SNDP (EC-SNDP) originally due to Jain [Jai01]. The second is to make some additional connections between hypergraphic version of SNDP (Hypergraph-SNDP) introduced in [ZNI03...

متن کامل

A Note on Iterated Rounding for the Survivable Network Design Problem

In this note we consider the survivable network design problem (SNDP) in undirected graphs. We make two contributions. The first is a new counting argument in the iterated rounding based 2-approximation for edge-connectivity SNDP (EC-SNDP) originally due to Jain [10]. The second contribution is to make some connections between hypergraphic version of SNDP (Hypergraph-SNDP) introduced in [17] an...

متن کامل

A Note on Fractional Coloring and the Integrality gap of LP for Maximum Weight Independent Set

We prove a tight connection between two important notions in combinatorial optimization. Let G be a graph class (i.e. a subset of all graphs) and r(G) = supG∈G χf (G) ω(G) where χf (G) and ω(G) are the fractional chromatic number and clique number of G respectively. In this note, we prove that r(G) tightly captures the integrality gap of the LP relaxation with clique constraints for the Maximum...

متن کامل

Survivable Network Design with Degree or Order

We present algorithmic and hardness results for network design problems with degree or order constraints. The first problem we consider is the Survivable Network Design problem with degree constraints on vertices. The objective is to find a minimum cost subgraph which satisfies connectivity requirements between vertices and also degree upper bounds Bv on the vertices. This includes the well-stu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1608.04768  شماره 

صفحات  -

تاریخ انتشار 2016